Optimization Issues in R-tree Construction

The construction of an efficient tree structure should take into account parameters which can be optimised. Coverage of a node, "dead area" of a node and overlap between nodes are examples of such parameters. Taking these parameters under account is important since minimization of a node coverage leads to more precise searching within the tree, minimization of a node "dead area" reduces the number of unsuccessful hits in the tree, and minimization of the overlap between nodes reduces the number of paths tested in the tree during a search. Existing access methods do not combine all these parameters. In this paper we propose a combination of all of the above criteria into a complex one which would be responsible for the tree construction. We study the algorithms affected and provide preliminary experimental results to indicate the effectiveness of the methods.